The Magnets Puzzle is NP-Complete
نویسنده
چکیده
In a Magnets puzzle, one must pack magnets in a box subject to polarity and numeric constraints. We show that deciding solvability of Magnets instances is NP-complete.
منابع مشابه
On The NP-Completeness of The Nurikabe Pencil Puzzle and Variants Thereof
We show that the popular pencil puzzle Nurikabe is intractable from the computational complexity point of view, i.e., is NP-complete, even when the involved numbers are 1 and 2 only. To this end we show how to simulate Boolean gates by the puzzle under consideration. Moreover, we also study some Nurikabe variants, which remain NP-complete, too.
متن کاملSpiral Galaxies Puzzles are NP-complete
We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملThe Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...
متن کاملThe Fewest Clues Problem
When analyzing the computational complexity of well-known puzzles, most papers consider the algorithmic challenge of solving a given instance of (a generalized form of) the puzzle. We take a different approach by analyzing the computational complexity of designing a “good” puzzle. We assume a puzzle maker designs part of an instance, but before publishing it, wants to ensure that the puzzle has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JIP
دوره 20 شماره
صفحات -
تاریخ انتشار 2012